This 1994 text covers finite linear spaces. It contains all the important results that had been published up to the time of publication, and is designed to be used not only as a resource for researchers in this and related areas, but also as a graduate-level text. In eight chapters the authors introduce and review fundamental results, and go on to cover the major areas of interest in linear spaces. A combinatorial approach is used for the greater part of the book, but in the final chapter recent advances in group theory relating to finite linear spaces are presented. At the end of each chapter there is a set of exercises which are designed to test comprehension of the material, and there is also a section of problems for researchers. It will be an invaluable book for researchers in geometry and combinatorics as well as forming an excellent text for graduate students.

Combinatorics of Finite Geometries is an introductory text on the combinatorial theory of finite geometry. Assuming only a basic knowledge of set theory and analysis, it provides a thorough review of the topic and leads the student to results at the frontiers of research. This book begins with an elementary combinatorial approach to finite geometries based on finite sets of points and lines, and moves into the classical work on affine and projective planes. Later, it addresses polar spaces, partial geometries, and generalized quadrangles. The revised edition contains an entirely new chapter on blocking sets in linear spaces, which highlights some of the most important applications of blocking sets--from the initial game-theoretic setting to their very recent use in cryptography. Extensive exercises at the end of each chapter insure the usefulness of this book for senior undergraduate and beginning graduate students.

Combinatorics of Finite Geometries is an introductory text on the combinatorial theory of finite geometry. Assuming only a basic knowledge of set theory and analysis, it provides a thorough review of the topic and leads the student to results at the frontiers of research. This book begins with an elementary combinatorial approach to finite geometries based on finite sets of points and lines, and moves into the classical work on affine and projective planes. Later, it addresses polar spaces, partial geometries, and generalized quadrangles. The revised edition contains an entirely new chapter on blocking sets in linear spaces, which highlights some of the most important applications of blocking sets--from the initial game-theoretic setting to their very recent use in cryptography. Extensive exercises at the end of each chapter insure the usefulness of this book for senior undergraduate and beginning graduate students.

This 1994 text covers finite linear spaces. It contains all the important results that had been published up to the time of publication, and is designed to be used not only as a resource for researchers in this and related areas, but also as a graduate-level text. In eight chapters the authors introduce and review fundamental results, and go on to cover the major areas of interest in linear spaces. A combinatorial approach is used for the greater part of the book, but in the final chapter recent advances in group theory relating to finite linear spaces are presented. At the end of each chapter there is a set of exercises which are designed to test comprehension of the material, and there is also a section of problems for researchers. It will be an invaluable book for researchers in geometry and combinatorics as well as forming an excellent text for graduate students.

Complete coverage of the current major public key cryptosystems their underlying mathematics and the most common techniques used in attacking them "Public Key Cryptography: Applications and Attacks" introduces and explains the fundamentals of public key cryptography and explores its application in all major public key cryptosystems in current use, including ElGamal, RSA, Elliptic Curve, and digital signature schemes. It provides the underlying mathematics needed to build and study these schemes as needed, and examines attacks on said schemes via the mathematical problems on which they are based - such as the discrete logarithm problem and the difficulty of factoring integers.The book contains approximately ten examples with detailed solutions, while each chapter includes forty to fifty problems with full solutions for odd-numbered problems provided in the Appendix. "Public Key Cryptography: "- Explains fundamentals of public key cryptography- Offers numerous examples and exercises- Provides excellent study tools for those preparing to take the Certified Information Systems Security Professional (CISSP) exam- Provides solutions to the end-of-chapter problems

"Public Key Cryptography" provides a solid background for anyone who is employed by or seeking employment with a government organization, cloud service provider, or any large enterprise that uses public key systems to secure data.